- fast Fourier transform method
- Макаров: метод быстрого преобразования Фурье
Универсальный англо-русский словарь. Академик.ру. 2011.
fast Fourier transform method
Смотреть что такое "fast Fourier transform method" в других словарях:
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… … Wikipedia
Fourier transform on finite groups — In mathematics, the Fourier transform on finite groups is a generalization of the discrete Fourier transform from cyclic to arbitrary finite groups.DefinitionsThe Fourier transform of a function f : G ightarrow mathbb{C},at a representation ho,… … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
Short-time Fourier transform — The short time Fourier transform (STFT), or alternatively short term Fourier transform, is a Fourier related transform used to determine the sinusoidal frequency and phase content of local sections of a signal as it changes over time. STFT… … Wikipedia
Discrete-time Fourier transform — In mathematics, the discrete time Fourier transform (DTFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the DTFT , of the… … Wikipedia
Fourier profilometry — is a method for measuring profiles using distortions in periodic patterns. The method uses Fourier analysis (a 2 dimensional Fast Fourier transform) to determine localized slopes on a curving surface.This allows a x , y , z coordinate system of… … Wikipedia
Spectral method — Spectral methods are a class of techniques used in applied mathematics and scientific computing to numerically solve certain Dynamical Systems, often involving the use of the Fast Fourier Transform. Where applicable, spectral methods have… … Wikipedia
Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… … Wikipedia
Split-step method — In numerical analysis, the split step (Fourier) method is a pseudo spectral numerical method used to solve nonlinear partial differential equations like the nonlinear Schrödinger equation. The name arises for two reasons. First, the method relies … Wikipedia
Modified discrete cosine transform — The modified discrete cosine transform (MDCT) is a Fourier related transform based on the type IV discrete cosine transform (DCT IV), with the additional property of being lapped: it is designed to be performed on consecutive blocks of a larger… … Wikipedia
